Mixed-integer bilevel optimization for capacity planning with rational markets
نویسندگان
چکیده
We formulate the capacity expansion planning as a bilevel optimization to model the hier-archical decision structure involving industrial producers and consumers. The formulation isa mixed-integer bilevel linear program in which the upper level maximizes the profit of a pro-ducer and the lower level minimizes the cost paid by markets. The upper-level problem includesmixed-integer variables that establish the expansion plan; the lower level problem is an LP thatdecides demands assignments. We reformulate the bilevel optimization as a single-level problemusing two different approaches: KKT reformulation and duality-based reformulation. We ana-lyze the performance of these reformulations and compare their results with the expansion plansobtained from the traditional single-level formulation. For the solution of large-scale problems,we propose improvements on the duality-based reformulation that allows reducing the numberof variables and constraints. The formulations and the solution methods are illustrated withexamples from the air separation industry.
منابع مشابه
Parametric global optimisation for bilevel programming
We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed parametric programming algorithms. We first describe how we can recast and solve the inner (follower’s) problem of the bilevel formulation as a multi-parametric programming problem, with parameters being the (unknown) variables of the outer (leader’s) ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملGlobal optimization of mixed-integer bilevel programming problems
Global optimization of mixed-integer nonlinear bilevel optimization problems is addressed using a novel technique. For problems where integer variables participate in both inner and outer problems, the outer level may involve general mixed-integer nonlinear functions. The inner level may involve functions that are mixed-integer nonlinear in outer variables, linear, polynomial, or multilinear in...
متن کاملAdvanced OR and AI Methods in Transportation JOINT PRICING AND NETWORK CAPACITY SETTING PROBLEM
We consider the problem of jointly determining installed capacity levels and associated tariffs on the arcs of a multicommodity transportation network. We model this situation as a joint pricing and network capacity setting problem. Capacities are available at discrete, non uniform levels. This problem is first formulated as a mixed integer bilevel program. Next, we develop an algorithmic frame...
متن کاملExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Chemical Engineering
دوره 86 شماره
صفحات -
تاریخ انتشار 2016